Boolean filters of distributive lattices
نویسنده
چکیده
In this paper we introduce the notion of Boolean filters in a pseudo-complemented distributive lattice and characterize the class of all Boolean filters. Further a set of equivalent conditions are derived for a proper filter to become a prime Boolean filter. Also a set of equivalent conditions is derived for a pseudo-complemented distributive lattice to become a Boolean algebra. Finally, a Boolean filter is characterized in terms of congruences.
منابع مشابه
Semi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کاملBoolean Algebras and Distributive Lattices Treated Constructively
Some aspects of the theory of Boolean algebras and distributive lattices -in particular, the Stone Representation Theorems and the properties of filters and ideals -are analyzed in a constructive setting.
متن کاملBoolean Lifting Properties for Bounded Distributive Lattices
In this paper, we introduce the lifting properties for the Boolean elements of bounded distributive lattices with respect to the congruences, filters and ideals, we establish how they relate to each other and to significant algebraic properties, and we determine important classes of bounded distributive lattices which satisfy these lifting properties.
متن کاملPrime Filters and Ideals in Distributive Lattices
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the Mizar Mathematical Library, there are some attempts to formalize prime ideals and filters; one series of articles written as decoding [9] proven some results; we tried however to follow [21], [12], and [13]. All three were devoted to the Stone repr...
متن کاملA Note on the Set-Theoretic Representation of Arbitrary Lattices
Every lattice is isomorphic to a lattice whose elements are sets of sets and whose operations are intersection and the operation ∨∗ defined by A ∨∗ B = A ∪ B ∪ {Z : (∃X ∈ A)(∃Y ∈ B)X ∩ Y ⊆ Z}. This representation spells out precisely Birkhoff’s and Frink’s representation of arbitrary lattices, which is related to Stone’s set-theoretic representation of distributive lattices. (AMS Subject Classi...
متن کامل